On the Conservation Law and the Performance Space of Single Server Systems

نویسندگان

  • Leonidas Georgiadis
  • Yannis Viniotis
چکیده

We consider a multiclass GI|G|1 queueing system, operating under an arbitrary work-conserving scheduling policy π. We derive an invariance relation for the Cesaro sums of waiting times under π, which does not require the existence of limits of the Cesaro sums. This allows us to include in the set of admissible policies important classes, such as time-dependent and adaptive policies. For these classes of policies, ergodicity is not known a priori and may not even exist. Therefore, the classical invariance relations, involving statistical averages do not hold. For anM |G|1 system, we derive inequalities involving the Cesaro sums of waiting times, that further characterize the achievable performance region of the system.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A SINGLE SERVER BERNOULLI VACATION QUEUE WITH TWO TYPE OF SERVICES AND WITH RESTRICTED ADMISSIBILITY

A single server queue with Bernoulli vacation has been considered. In addition the admission to queue is based on a Bernoulli process and the server gives two type of services. For this model the probability generating function for the number of customers in the queue at different server's state are obtained using supplementary variable technique. Some performance measures are calculated. Some ...

متن کامل

بهینه‌سازی اجرا و پاسخ صفحات وب در فضای ابری با روش‌های پیش‌پردازش، مطالعه موردی سامانه‌های وارنیش و انجینکس

The response speed of Web pages is one of the necessities of information technology. In recent years, renowned companies such as Google and computer scientists focused on speeding up the web. Achievements such as Google Pagespeed, Nginx and varnish are the result of these researches. In Customer to Customer(C2C) business systems, such as chat systems, and in Business to Customer(B2C) systems, s...

متن کامل

Stochastic bounds for a single server queue with general retrial times

We propose to use a mathematical method based on stochastic comparisons of Markov chains in order to derive performance indice bounds‎. ‎The main goal of this paper is to investigate various monotonicity properties of a single server retrial queue with first-come-first-served (FCFS) orbit and general retrial times using the stochastic ordering techniques‎.

متن کامل

On Two-Echelon Multi-Server Queue with Balking and Limited Intermediate Buffer

In this paper we study two echelon multi-server tandom queueing systems where customers arrive according to a poisson process with two different rates. The service rates at both echelons are independent of each other. The service times of customers is assumed to be completed in two stages. The service times at each stage are exponentially distributed. At the first stage, the customers may balk ...

متن کامل

FINITE POPULATION SINGLE SERVER BATCH SERVICE QUEUE WITH COMPULSORY SERVER VACATION

A single server finite population queueing model with compulsory server vacation and with fixed batch service has been considered. For this model the system steady state probabilities are obtained. Some performance measures are calculated and numerical examples are also given.  

متن کامل

Single Server Bulk Queue with Service Interruption, Two Phase Repairs and State Dependent Rates

This paper reports a study on a single server queue with bulk arrival and bulk service patterns wherein the incoming traffic depends on the state of the server which may be in operating or breakdown state. The repair of the breakdown server is performed in two phases. The operating duration of server, repair duration of both phases of repairing as well as job's inter-arrival times and service t...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Operations Research

دوره 42  شماره 

صفحات  -

تاریخ انتشار 1994